The general counterfeit coin problem
نویسندگان
چکیده
منابع مشابه
The general counterfeit coin problem
Given c nickels among which there may be a counterfeit coin, which can only be told apart by its weight being di erent from the others, and moreover b balances. What is the minimal number of weighings to decide whether there is a counterfeit nickel, if so which one it is and whether it is heavier or lighter than a genuine nickel. We give an answer to this question for sequential and nonsequenti...
متن کاملSNIEDOVICH OR/MS Games: 3. Counterfeit Coin Problem OR/MS Games: 3. Counterfeit Coin Problem
In this discussion we examine two versions of the famous Counterfeit Coin Problem, focusing on their educational OR/MS content. It is shown that this problem provides an excellent environment for illustrating a number of fundamental OR/MS problem-solving concepts and methods related to decision making under uncertainty. A number of interactive modules are provided for experimentation with this ...
متن کاملSolution to the Counterfeit Coin Problem and its Generalization
This work deals with a classic problem: ”Given a set of coins among which there is a counterfeit coin of a different weight, find this counterfeit coin using ordinary balance scales, with the minimum number of weighings possible, and indicate whether it weighs less or more than the rest”. The method proposed here not only calculates the minimum number of weighings necessary, but also indicates ...
متن کاملOptimal non-adaptive solutions for the counterfeit coin problem
We give optimal solutions to all versions of the popular counterfeit coin problem obtained by varying whether (i) we know if the counterfeit coin is heavier or lighter than the genuine ones, (ii) we know if the counterfeit coin exists, (iii) we have access to additional genuine coins, and (iv) we need to determine if the counterfeit coin is heavier or lighter than the genuine ones. Moreover, ou...
متن کاملOn Anomaly Identification and the Counterfeit Coin Problem
We address a well-known problem in combinatorics involving the identification of counterfeit coins with a systematic approach. The methodology can be applied to cases where the total number of coins is exceedingly large such that brute force or enumerative comparisons become impractical. Based on the principle behind this approach, the minimum effort necessary for identification of the counterf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1995
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00232-8